Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
نویسندگان
چکیده
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing and computationally binding. Unlike the classical reduction of Naor, Ostrovski, Ventkatesen and Young, our protocol is non-interactive and has communication complexity O(n) qubits for n a security parameter.
منابع مشابه
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
We investigate the Goldreich-Levin Theorem in the context of quantum information. This result is a reduction from the computational problem of inverting a one-way function to the problem of predicting a particular bit associated with that function. We show that the quantum version of the reduction—between quantum one-way functions and quantum hard-predicates—is quantitatively more efficient tha...
متن کاملM ar 2 00 4 An Unconditionally Secure Quantum Bit Commitment Scheme
An unconditionally secure quantum bit commitment is proposed in this paper. we show that this scheme is statistically binding and perfectly concealing. The security of the protocol is based on the existence of quantum one-way functions by fundamental principles of quantum physics. As a conclusion of this paper, statistically binding and perfectly concealing quantum bit commitment schemes can be...
متن کاملAn Unconditionally Secure Quantum Bit Commitment Scheme ⋆
Bit commitment plays an important role in modern cryptography and is widely utilized in protocol design. In this paper, we propose an unconditionally secure quantum bit commitment scheme which is statistically binding and perfectly concealing. The security of this scheme is based on the existence of quantum one-way functions by fundamental principles of quantum physics. As a conclusion of this ...
متن کاملHow to Convert a Flavor of Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence, statistically concealing but computationall...
متن کاملConverting the flavor of a quantum bit commitment
The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n) executions of the statistically binding scheme. As a consequence of the reduction, statist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000